On Groups Whose Word Problem Is Solved by a Nested Stack Automaton
نویسنده
چکیده
Accessible groups whose word problems are accepted by a deterministic nested stack automaton with limited erasing are virtually
منابع مشابه
Groups with Indexed Co-word Problem
We investigate co-indexed groups, that is groups whose co-word problem (all words defining nontrivial elements) is an indexed language. We show that all Higman-Thompson groups and a large class of tree automorphism groups defined by finite automata are co-indexed groups. The latter class is closely related to dynamical systems and includes the Grigorchuk 2-group and the Gupta-Sidki 3-group. The...
متن کاملModel Checking Concurrent Recursive Programs Using Temporal Logics
We consider two bounded versions of the model checking problem of a fixed temporal logic TL whose modalities are MSO-definable and which is specifying properties of multiply nested words, i.e., of runs of pushdown automata with multiple stacks. One of the problems asks, given a multi-stack system A, a temporal formula F from TL, and a bound k, whether all nested words ν which are accepted by A ...
متن کاملRegularity Problems for Visibly Pushdown Languages
Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input symbols according to a partition of the alphabet. We show that it is decidable for a given visibly pushdown automaton whether it is equivalent to a visibly counter automaton, i.e. an automaton that uses its stack only as counter. In particular, this allows to decide whether a given visibly pushdo...
متن کاملProperties of Visibly Pushdown Transducers
Visibly pushdown transducers form a subclass of pushdown transducers that (strictly) extends finite state transducers with a stack. Like visibly pushdown automata, the input symbols determine the stack operations. In this paper, we prove that functionality is decidable in PSPACE for visibly pushdown transducers. The proof is done via a pumping argument: if a word with two outputs has a sufficie...
متن کاملAn Over-Approximation Forward Analysis for Nested Timed Automata
Nested timed automata(NeTAs), proposed by Li et al., are a pushdown system whose stack symbols are timed automata (TAs). With this formal models, we can model and analyze complex real-time frameworks with recursive context switches. The reachability problem of NeTAs is proved to be decidable, via encoding NeTAs to dense timed pushdown automata (DTPDAs). This paper gives a forward algorithm for ...
متن کامل